A decisive characterization of BPP

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Pseudorandom Oracle Characterization of BPP

It is known from work of Bennett and Gill and Ambos-Spies that the following conditions are equivalent. (i) L 2 BPP. (ii) For almost all oracles A, L 2 P A . It is shown here that the following conditions are also equivalent to (i) and (ii). (iii) The set of oracles A for which L 2 P A has pspace-measure 1. (iv) For every pspace-random oracle A, L 2 P A . It follows from this characterization (...

متن کامل

A Theory of Decisive Leadership

We present a theory that rationalizes voters’ preference for decisive leaders. Common definitions of decisiveness reference the speed of decision making. Although greater speed can be good or bad, agency problems between voters and politicians create a natural preference among voters for leaders who have a greater aversion to delay or more self-knowledge than the voters, and hence who make deci...

متن کامل

In a World of P=BPP

We show that proving results such as BPP = P essentially necessitate the construction of suitable pseudorandom generators (i.e., generators that suffice for such derandomization results). In particular, the main incarnation of this equivalence refers to the standard notion of uniform derandomization and to the corresponding pseudorandom generators (i.e., the standard uniform notion of “canonica...

متن کامل

Notes on derandomising BPP

Notes from a paper by Nisan and Wigderson to show how to prove P = BPP starting from an assumption about the existence of a language in DTIME(2) which no subexponential circuits can approximate.

متن کامل

BPP , Proof systems

We currently do not have a very good unconditional bound on the power of BPP — in particular, it could be that BPP = NEXP. Perhaps surprisingly, especially in light of the many randomized algorithms known, the current conjecture is that BPP is not more powerful than P. We will return to this point later in the semester when we talk about derandomization. What (unconditional) upper bounds can we...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1986

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(86)80044-4